Retrograde analysis of Kriegspiel endgames Paolo Ciancarini and Gian Piero Favini Abstract—A game tree can be constructed starting from its leaves with a technique called Retrograde Analysis. It is useful to solve some

Source URL: game.itu.dk

• Chess
• Game theory
• Gaming
• Chess rules
• Chess theory
• Chess endgames
• Kriegspiel
• Endgame tablebase
• Chess endgame
• Outline of chess
• Computer chess
• Checkmate

Monte Mario: Platforming with MCTS Emil Juul Jacobsen Rasmus Greve Julian Togelius

Source URL: julian.togelius.com

• Game artificial intelligence
• Monte Carlo tree search
• General game playing
• A* search algorithm
• Tree traversal
• Super Mario
• Artificial intelligence
• Trie
• Tree

Tree Game CPSPC 2006 Warszawa, Den 4. Submit: game.c / game.cpp / game.pas Input: stdin

Source URL: mo.mff.cuni.cz

Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata Jacques Duparc1 , Alessandro Facchini1,2? , and Filip Murlak3?? 1

Source URL: my.unil.ch

Online Evolution for Multi-Action Adversarial Games Niels Justesen1 , Tobias Mahlmann2 , and Julian Togelius3 1 2 IT University of Copenhagen

Source URL: julian.togelius.com

• Mathematics
• Game artificial intelligence
• Search algorithms
• Applied mathematics
• Combinatorial game theory
• Minimax
• Monte Carlo tree search
• Negamax
• Monte Carlo method
• Heuristic
• Greedy algorithm
• A* search algorithm

Reinforcement Learning Techniques in ’Jumper’ MITCHELL BRUNTON and SHAANAN N. COHNEY University of Melbourne General Terms: Machine Learning, Jumper

Source URL: cohney.info

• Game artificial intelligence
• Search algorithms
• Minimax
• Alphabeta pruning
• Principal variation search
• Artificial neural network
• Variation
• Reinforcement learning
• Pruning
• Game tree
• TD-Gammon
• Tree traversal

A Risky Proposal: Designing a Risk Game Playing Agent Juan Lozano, Dane Bratz, Abstract Monte Carlo Tree Search methods provide a general framework for modeling decision problems

Source URL: cs229.stanford.edu

General Video Game Evaluation Using Relative Algorithm Performance Profiles Thorbjørn S. Nielsen1 , Gabriella A. B. Barros1 , Julian Togelius2 , and Mark J. Nelson3 1 2

Source URL: julian.togelius.com

• Leisure
• Game theory
• Gaming
• Game artificial intelligence
• General game playing
• Game Description Language
• Monte Carlo tree search
• Video game
• Game
• Genetic algorithm
• Randomness
• Arcade game

Monte Carlo Tree Search in Go Adrien Cou¨etoux and Martin M¨uller and Olivier Teytaud Abstract Monte Carlo Tree Search (MCTS) was born in Computer Go, i.e. in the application of artificial intelligence to the game of G

Source URL: webdocs.cs.ualberta.ca

Playout Policy Adaptation for Games Tristan Cazenave∗ LAMSADE Université Paris-Dauphine Abstract. Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a

Source URL: www.lamsade.dauphine.fr